|
In mathematics, the Milstein method is a technique for the approximate numerical solution of a stochastic differential equation. It is named after Grigori N. Milstein who first published the method in 1974. ==Description== Consider the autonomous Itō stochastic differential equation : with initial condition ''X''0 = ''x''0, where ''W''''t'' stands for the Wiener process, and suppose that we wish to solve this SDE on some interval of time (). Then the Milstein approximation to the true solution ''X'' is the Markov chain ''Y'' defined as follows: * partition the interval () into ''N'' equal subintervals of width : : * set * recursively define for by : where denotes the derivative of with respect to and : are independent and identically distributed normal random variables with expected value zero and variance . Then will approximate for , and increasing will yield a better approximation. Note that when , i.e. the diffusion term does not depend on , this method is equivalent to the Euler–Maruyama method The Milstein scheme has both weak and strong order of convergence , which is superior to the Euler–Maruyama method, that has the same weak order of convergence , but inferior strong order of convergence .〔V. Mackevičius, ''Introduction to Stochastic Analysis'', Wiley 2011〕 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Milstein method」の詳細全文を読む スポンサード リンク
|